FPGA Implementation of Elliptic-Curve Diffie Hellman Protocol
نویسندگان
چکیده
This paper presents an efficient crypto processor architecture for key agreement using ECDH (Elliptic-curve Diffie Hellman) protocol over . The composition of our key-agreement is expressed in consisting the following: (i) Elliptic-curve Point Multiplication public generation (DESIGN-I) and (ii) integration DESIGN-I with two additional routing multiplexers a controller shared (DESIGN-II). arithmetic operators used DESIGN-II contain adder, squarer, multiplier inversion. A simple shift add multiplication method employed to retain lower hardware resources. Moreover, essential inversion operation operated Itoh-Tsujii algorithm similar resources squarer units. proposed implemented Verilog HDL. implementation results are given on Xilinx Virtex-7 FPGA (field-programmable gate array) device. For , utilized Slices 3983 4037, time compute one secret 553.7 μs 1170.7 (iii) consumed power 29 μW 57 μW. Consequently, achieved area optimized reduced show that suitable alternative (to generate secret) applications require low consumption.
منابع مشابه
Elliptic Curve Diffie-Hellman Protocol Implementation Using Picoblaze
Compared to other public key cryptography counterparts like Diffie-Hellman (DH) and Rivest Shamir Adleman (RSA), Elliptic Curve Cryptography (ECC) is known to provide equivalent level of security with lower number of bits used. Reduced bit usage implies less power and logic area are required to implement this cryptographic scheme. This is particularly important in wireless networks, where a hig...
متن کاملInterpolation of the Elliptic Curve Diffie-Hellman Mapping
We prove lower bounds on the degree of polynomials interpolating the Diffie–Hellman mapping for elliptic curves over finite fields and some related mappings including the discrete logarithm. Our results support the assumption that the elliptic curve Diffie–Hellman key exchange and related cryptosystems are secure.
متن کاملOn the Bit Security of Elliptic Curve Diffie-Hellman
This paper gives the first bit security result for the elliptic curve Diffie–Hellman key exchange protocol for elliptic curves defined over prime fields. About 5/6 of the most significant bits of the x-coordinate of the Diffie–Hellman key are as hard to compute as the entire key. A similar result can be derived for the 5/6 lower bits. The paper also generalizes and improves the result for ellip...
متن کاملBits Security of the Elliptic Curve Diffie-Hellman Secret Keys
We show that the least significant bits (LSB) of the elliptic curve Diffie–Hellman secret keys are hardcore. More precisely, we prove that if one can efficiently predict the LSB with non-negligible advantage on a polynomial fraction of all the curves defined over a given finite field Fp, then with polynomial factor overhead, one can compute the entire Diffie–Hellman secret on a polynomial fract...
متن کاملFPGA-SIDH: High-Performance Implementation of Supersingular Isogeny Diffie-Hellman Key-Exchange Protocol on FPGA
To the best of our knowledge, we present the first hardware implementation of isogeny-based cryptography available in the literature. Particularly, we present the first implementation of the supersingular isogeny Diffie-Hellman (SIDH) key exchange, which features quantum-resistance. We optimize this design for speed by creating a high throughput multiplier unit, taking advantage of parallelizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, materials & continua
سال: 2022
ISSN: ['1546-2218', '1546-2226']
DOI: https://doi.org/10.32604/cmc.2022.028152